Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network
نویسندگان
چکیده
Corelite is a Quality of Service architecture that provides weighted max-min fairness for rate among flows in a network without maintaining any per-flow state in the core routers. There are three key mechanisms that work in concert to achieve the service model of Corelite: (a) the introduction of markers in a packet flow by the edge routers to reflect the normalized rate of the flow, (b) weighted fair marker feedback at the core routers upon incipient congestion detection, and (c) linear increase/multiplicative decrease based rate adaptation of packet flows at the edge routers in response to marker feedback.
منابع مشابه
Core-Stateless Labeling Fairness: An Integrated Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks
Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require per-packet relabeling in the core routers. In this paper, we propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Fu...
متن کاملWeighted Fairness Guarantee for Scalable Differentiated Services (DiffServ)
Currently there is not enough work on the Internet weighted fair bandwidth sharing without per-flow management, especially when both UDP and TCP flows of different RTTs and different bandwidth targets coexist. This paper contains two contributions: 1 ) A mechanism called SCALE-WFS, Scalable Core with Aggregation Level labEling Weighted Fair bandwidth-Sharing, is presented to achieve near-optima...
متن کاملProviding Deterministic End-to-end Fairness Guarantees in Core-stateless Networks1
End-to-end fairness guarantee is an important service semantics that network providers would like to offer to their customers. A network provider can offer such service semantics by deploying a network where each router employs a fair packet scheduling algorithm. Unfortunately, these scheduling algorithms require every router to maintain per-flow state and perform per-packet flow classification...
متن کاملWeighted fair bandwidth sharing using SCALE technique
Currently there is not enough work on the Internet weighted fair bandwidth sharing without per-flow management, especially when both UDP and TCP flows of different RTTs and different bandwidth targets coexist. This paper contains two contributions: 1) A mechanism called SCALE-WFS, Scalable Core with Aggregation Level labEling Weighted Fair bandwidth-Sharing, is presented to achieve near-optimal...
متن کاملBuffer management schemes for supporting TCP in gigabit routers with per-flow queueing
Recently, there has been much interest in using active queue management in routers in order to protect users from connections that are not very responsive to congestion notification. A recent Internet draft recommends schemes based on random early detection for achieving the above goals, to the extent possible, in a system without “per-flow” state. However, a “stateless" system with FIFO queuei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000